package com.lcm.oj.lanqiao.year2021.moni.c3;

/**
 * @author Coder-lcm
 * @date 2021/4/17
 */
public class T1 {
    public static void main(String[] args) {
        int count = 0;
        for (int i = 1; i < 2020; i++) {
            if (gcb(i, 2020) == 1) {
                count++;
            }
        }
        System.out.println(count);
    }

    //求两个数的最大公因数
    public static int gcb(int num1, int num2) {
        return num2 == 0 ? num1 : gcb(num2, num1 % num2);
    }
}
